Characterizing time computational complexity classes with polynomial differential equations
نویسندگان
چکیده
In this paper we show that several classes of languages from computational complexity theory, such as EXPTIME, can be characterized in a continuous manner by using only polynomial differential equations. This characterization applies not to languages, but also functions, the defining Grzegorczyk hierarchy, which implies an analog class elementary computable functions and primitive recursive functions.
منابع مشابه
Computational complexity of solving polynomial differential equations over unbounded domains
In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y′ = p(y) over unbounded time domains, where p is a vector of polynomials. Contrarily to the bounded (compact) time case, this problem has not been well-studied, apparently due to the “intuition” that it can always be reduced to the bounded case by using rescaling techniques. However, as ...
متن کاملCharacterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
In this paper an implicit characterization of the complexity classes k-EXP and k-FEXP, for k ≥ 0, is given, by a type assignment system for a stratified λ-calculus, where types for programs are witnesses of the corresponding complexity class. Types are formulae of Elementary Linear Logic (ELL), and the hierarchy of complexity classes k-EXP is characterized by a hierarchy of types.
متن کاملComplexity Classes and Polynomial - time Reductions
The first hard problem we will examine is what is known as Satisfiability or SAT. As input, we are given a set of n boolean variables X = {x1, x2, . . . , xn} (i.e., each variable can be set to either true or false). We are then given a boolean formula over these variables of the following form (noting that this is just a specific example where X = {x1, x2, x3, x4}): (x1 ∨ x2 ∨ x3) ∧ (x2 ∨ x3 ∨...
متن کاملComputational bounds on polynomial differential equations
In this paper we study from a computational perspective some properties of the solutions of polynomial ordinary differential equations. We consider elementary (in the sense of Analysis) discrete-time dynamical systems satisfying certain criteria of robustness. We show that those systems can be simulated with elementary and robust continuous-time dynamical systems which can be expanded into full...
متن کاملComputational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients
In this note, we extend the result of [PG16] about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework of Conputable Analysis [Ko91]. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution. The complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2023
ISSN: ['2211-3576', '2211-3568']
DOI: https://doi.org/10.3233/com-210384